On Collision Resistance of Generalized Cellular Automata

Abstract collision systems simulated by cellular automata

collision systems simulated by cellular automata T. Ito, S.Inokuchi & Y.Mizoguchi

Simulation of Generalized Synchronization Processes on One-Dimensional Cellular Automata

Cellular automata are considered to be a nice model of complex systems in which an infinite onedimensional array of finite state machines (cells) updates itself in synchronous manner according to a uniform local rule. We study a generalized synchronization problem that gives a finite-state protocol for synchronizing a large scale of cellular automata with an initial initiator at any generalized...

Parallel Computing with Generalized Cellular Automata

Percolation and Disorder-Resistance in Cellular Automata

We rigorously prove a form of disorder-resistance for a class of one-dimensional cellular automaton rules, including some that arise as boundary dynamics of two-dimensional solidification rules. Specifically, when started from a random initial seed on an interval of length L, with probability tending to one as L → ∞, the evolution is a replicator. That is, a region of space-time of density one ...

Cellular Automata: Elementary Cellular Automata

Cellular automata (CA) are discrete dynamical systems consist of a regular finite grid of cell; each cell encapsulating an equal portion of the state, and arranged spatially in a regular fashion to form an n-dimensional lattice. A cellular automata is like computers, data represented by initial configurations which is processed by time evolution to produce output. This paper is an empirical stu...